Diclib.com
Dictionnaire ChatGPT

Recherche dans le dictionnaire Solutions personnalisées

Entrez un mot ou une phrase dans n'importe quelle langue 👆

Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

comment le mot est utilisé
fréquence d'utilisation
il est utilisé plus souvent dans le discours oral ou écrit
options de traduction de mots
exemples d'utilisation (plusieurs phrases avec traduction)
étymologie

Qu'est-ce (qui) est depth-first search - définition

SEARCH ALGORITHM

Depth first search; Depth-first; DFS algorithm; Depth-first traversal; Depth-First Search; Back edge; Forward edge; Depth First Search; Applications of depth-first search

depth-first search

<algorithm> A graph search algorithm which extends the current path as far as possible before backtracking to the last choice point and trying the next alternative path. Depth-first search may fail to find a solution if it enters a cycle in the graph. This can be avoided if we never extend a path to a node which it already contains. Opposite of breadth first search. See also {iterative deepening}. (1995-04-19)

Depth-first search

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.

https://en.wikipedia.org/wiki/Depth-first_search

breadth-first search

ALGORITHM FOR SEARCHING THE NODES OF A GRAPH IN ORDER BY THEIR HOP COUNT FROM A STARTING NODE

Breadth first search; Breadth first recursion; Breadth-first traversal; BFS algorithm; Breadth-first; Breath first search; Breath-first search; Breadth-First Search; Applications of breadth-first search

<algorithm> A graph search algorithm which tries all one-step extensions of current paths before trying larger extensions. This requires all current paths to be kept in memory simultaneously, or at least their end points. Opposite of depth-first search. See also {best first search}. (1996-01-05)

Wikipédia

Depth-first search

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph.

A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes.

https://en.wikipedia.org/wiki/Depth-first search